Hierarchical Hashing for Pattern Search in 3D Vector Fields Additional Material

نویسندگان

  • Zhongjie Wang
  • Hans Peter Seidel
  • Tino Weinkauf
چکیده

Abstract In this material, we present an analysis of different LSH strategies and parameters. Firstly, We evaluate the accuracy of hashing retrieval under different number of hashing functions. Secondly, we compare the classic LSH algorithm [IM98] and multi-probe LSH algorithm [LJW∗07] based on their accuracy of retrieval. Our selections of strategy and parameters are all based on these evaluations.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Hierarchical Hashing for Pattern Search in 3D Vector Fields

The expressiveness of many visualization methods for 3D vector fields is often limited by occlusion, i.e., interesting flow patterns hide each other or are hidden by laminar flow. Automatic detection of patterns in 3D vector fields has gained attention recently, since it allows to highlight user-defined patterns and separate the wheat from the chaff. We propose an algorithm which is able to det...

متن کامل

Pattern search for the visualization of scalar, vector, and line fields

The main topic of this thesis is pattern search in data sets for the purpose of visual data analysis. By giving a reference pattern, pattern search aims to discover similar occurrences in a data set with invariance to translation, rotation and scaling. To address this problem, we developed algorithms dealing with different types of data: scalar fields, vector fields, and line fields. For scalar...

متن کامل

Locality sensitive hashing: A comparison of hash function types and querying mechanisms

It is well known that high-dimensional nearest-neighbor retrieval is very expensive. Dramatic performance gains are obtained using approximate search schemes, such as the popular Locality-Sensitive Hashing (LSH). Several extensions have been proposed to address the limitations of this algorithm, in particular, by choosing more appropriate hash functions to better partition the vector space. All...

متن کامل

Compressed Image Hashing using Minimum Magnitude CSLBP

Image hashing allows compression, enhancement or other signal processing operations on digital images which are usually acceptable manipulations. Whereas, cryptographic hash functions are very sensitive to even single bit changes in image. Image hashing is a sum of important quality features in quantized form. In this paper, we proposed a novel image hashing algorithm for authentication which i...

متن کامل

Image authentication using LBP-based perceptual image hashing

Feature extraction is a main step in all perceptual image hashing schemes in which robust features will led to better results in perceptual robustness. Simplicity, discriminative power, computational efficiency and robustness to illumination changes are counted as distinguished properties of Local Binary Pattern features. In this paper, we investigate the use of local binary patterns for percep...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2015